Algebraic Geometric Coding Theory
نویسندگان
چکیده
Acknowledgements Firstly, I would like to thank my supervisor, Dr David R. Kohel whose many helpful comments and patient guidance made this thesis possible. Secondly, I would like to thank David Gruenwald for volunteering his time to proofread this thesis. Almost all of his recommendations were taken on board. This thesis is the better for it. To a less extent, my thanks go to the IT school of University of Sydney for making this excellent thesis template available for general use.
منابع مشابه
Computer algebra and geometry – some interactions
Algebraic curves and surfaces have been studied intensively in algebraic geometry for centuries. Thus, there exists a huge amount of theoretical knowledge about these geometric objects. Recently, algebraic curves and surfaces play an important and ever increasing rôle in computer aided geometric design, computer vision, computer aided manufacturing, coding theory, and cryptography, just to name...
متن کاملNotes on Algebraic-geometric Codes
Ideas from algebraic geometry became useful in coding theory after Goppa’s construction [8]. He had the beautiful idea of associating to a curve X defined over Fq, the finite field with q elements, a code C. This code, called Algebraic-Geometric (AG) code, is constructed from two divisors D and G on X , where one of them, say D, is the sum of n distinct Fq-rational points of X . It turns out th...
متن کاملLee Weights of Z/4z-codes from Elliptic Curves
In [15], the second author defined algebraic geometric codes over rings. This definition was motivated by two recent trends in coding theory: the study of algebraic geometric codes over finite fields, and the study of codes over rings. In that paper, many of the basic parameters of these new codes were computed. However, the Lee weight, which is very important for codes over the ring Z/4Z, was ...
متن کاملUniversal Hashing and Geometric Codes
We describe a new application of algebraic coding theory to universal hashing and authentication without secrecy. This permits to make use of the hitherto sharpest weapon of coding theory, the construction of codes from algebraic curves. We show in particular how codes derived from Artin-Schreier curves, Hermitian curves and Suzuki curves yield classes of universal hash functions which are subs...
متن کاملAlgebraic Geometric Codes over Rings
Whenever information is transmitted across a channel, errors are likely to occur. Since Shannon’s groundbreaking paper [36], coding theorists have sought to construct codes that have many codewords, that are easy to encode and decode, and that correct errors. While the main tools used in coding theory have traditionally been those of combinatorics and group theory, this volume is dedicated to c...
متن کاملSecure Channel Coding Schemes based on Algebraic-Geometric Codes over Hermitian Curves
Algebraic-Geometric (AG) codes are new paradigm in coding theory with promising performance improvements and diverse applications in point to point communications services and system security. AG codes offer several advantages over stateof-the art Reed-Solomon (RS) codes. Algebraic-Geometric Codes are proposed and implemented in this paper. The design, construction and implementation are invest...
متن کامل